搜索资源列表
Balanced-binary-tree-operation-two
- 该程序主要是针对平衡二叉树的操作而设计的，程序执行的命令包括： （1）构造平衡二叉树；（2）输入数据； （3）对平衡二叉树的查找、插入、删除操作；（4）结束 -The program is mainly aimed balanced binary tree operation and design, program execution commands include: (a) construct a balanced binary tree (2) the input data
binary-tree-traversal-binary-tree
- 二叉树的结构特征，以及链式存储结构的特点及程序设计方法-The structure characteristics of two binary tree and the linked storage structure, the characteristics and the program design method
binary-tree
- 二叉树的遍历,包括先序遍历,中序遍历和后序遍历-traversing binary tree
Binary-Tree
- 主要利用二叉树对数据进行管理和处理，里面包含很到处理的源代码。-The main use of a binary tree for data management and processing, which contains the source code for it to handle.
binary-tree
- （1）输入字符序列，建立二叉链表。 （2）先序、中序、后序遍历二叉树:递归算法。 （3）中序遍历二叉树:非递归算法。（最好也能实现先序、后序非递归算法） （4）求二叉树的高度 。 （5）求二叉树的叶子个数。 （6）借助队列实现二叉树的层次遍历。 （7）在主函数中设计一个简单的菜单，分别调试上述算法。-(1) Enter the character sequence to build binary list. (2) first order, in sequence, a
file-binary-tree-run
- file binary tree run.rar
traversing-binary-tree
- 用于构建二叉树，并且有条件地遍历二叉树结构类型的数据，是一种常见的数据结构-it can be used to creat the binary tree,and traverse the binary tree,it s a common used data struct
binary-tree
- 二叉树的建立以和先序、中序、后序遍历以及层次遍历，还可以查找并删除节点等-the basic function of binary tree
Binary-Tree
- 关于二叉树的一些基本操作：创建、遍历、结点数、高度、交换左右孩子、等等。-Some basic operations on binary tree: Create, traverse, nodes, height, exchange or so kids, and so on.
Experimental-binary-tree-traversal
- 二叉树的创建及遍历实验 要求：数据元素类型ElemType取float。 1）从键盘按照前序遍历的顺序依次输入二叉树的各元素，创建此二叉树。 2）对该二叉树进行层次遍历，并输出遍历后的序列。(参照图的广度优先搜索)-Binary tree traversal create and test requirements: data element types ElemType take float. 1) from the keyboard in accordance with the
non-recursion-of-binary-tree
- 非递归建立二叉树，可以直接运行。采用堆栈的方法建立二叉树，而不是递归，展示了堆栈的先进后出的特性。数据结构的内容-Establishment of non-recursive binary tree can be run directly. Method to create a binary tree using the stack instead of recursion, showing advanced after stack features
The-basic-operation-of-a-binary-tree
- 二叉树的基本操作。包括树的（先序、中序、后序）创建、树的遍历（先序、中序、后序）、树的高度、树的宽度、树的叶子节点数-The basic operation of a binary tree. Including tree (first order, in sequence after sequence) created tree traversal (first order, in sequence after sequence), tree height, tree width, tree
All-the-basic-binary-tree
- 二叉数的全部基本操作，包括二叉树的建立及各种遍历，二叉树的各种信息，二叉树的各种操作-Total number of binary operations, including the establishment of tree and a variety of traversal, binary tree variety of information, a variety of binary operations
Binary-tree-traversal
- 二叉链表遍历，可以使用递归和非递归方法实现二叉树的前序，中序和后续遍历，以及层序遍历-Binary tree traversal, you can use recursive and non-recursive method to achieve binary tree preorder, inorder traversal and follow-up, as well as layer preorder
Binary-Tree
- POJ 文本二叉树 总的来说，又是数算作业啦啦啦（是自己写的哦~~~）-POJ text binary tree in general, but also to count jobs la la la (write by myself own oh ~ ~ ~)
binary-tree
- 程序的菜单功能项如下： 1------建立一棵二叉树 2------前序遍历递归算法 3------前序遍历非递归算法 4------中序遍历递归算法 5------中序遍历非递归算法 6------后序遍历递归算法 7------后序遍历非递归算法 8------求树高 9------求叶子总数 10-----输出二叉树 11-----退出 -Menu functions in program are as follows: 1------ 2-
binary-tree
- 二叉树的基本功能：1.生成一棵以二叉链表存储的二叉树bt (节点树可自定义)2.用递归方法前序、中序、后序遍历bt，并以缩格形式打印bt上各结点的信息3.交换bt上的所有左右子树，并以缩格形式打印出交换前-The basic function of a binary tree: a tree in order to generate a list stored in binary binary bt (node tree can be customized) 2 be
Binary-Tree
- 实现唯一的确定一棵二叉树，该方法相对简单方便。-Achieved only determine a binary tree, the method is relatively simple and easy.
the-static-binary-tree-and-input
- 建立一个静态二叉树，并对他进行先序遍历，已在vc6.0上运行通过。-To establish a static binary tree, and carries on his first sequence traversal, has run through in vc6.0
Binary-tree
- 根据输入字符串创建二叉树，输出二叉树的先根遍历和后根遍历序列。-Creating and traversing a binary tree